Syntactic Control of Interference Revisited

In “syntactic control of interference” (POPL, 1978), J.C. Reynolds proposes three design principles intended to constrain the scope of imperative state e ects in Algol-like languages. The resulting linguistic framework seems to be a very satisfactory way of combining functional and imperative concepts, having the desirable attributes of both purely functional languages (such as PCF) and simple imperative languages (such as the language of while programs). However, Reynolds points out that the “obvious” syntax for interference control has the unfortunate property that -reductions do not always preserve typings. Reynolds has subsequently presented a solution to this problem (ICALP, 1989), but it is fairly complicated and requires intersection types in the type system. Here, we present a much simpler solution which does not require intersection types. We rst describe a new type system inspired in part by linear logic and verify that reductions preserve typings. We then de ne a class of “bire ective” models, which provide a categorical analysis of structure underlying the new typing rules; a companion paper “Bire ectivity”, in this volume, exposes wider rami cations of this structure. Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such e orts in that states are not assumed to be structured using locations. c © 1999 Published by Elsevier Science B.V. All rights reserved.